Evaluating Erasure Codes in Dicoogle PACS
نویسندگان
چکیده
DICOM (Digital Imaging and Communication in Medicine) is a standard for image data transmission medical purpose hardware commonly used viewing, storing, printing transmitting images. As part of the way that transmits files, PACS (Picture Archiving System) platform, Dicoogle, has become one most in-demand processing viewing platforms. However, Dicoogle architecture does not guarantee information recovery case loss. Therefore, this paper proposes file solution architecture. The proposal consists maximizing encoding decoding performance images through computational parallelism. To validate proposal, Java programming language based on Reed-Solomon algorithm implemented different tests. experimental results show optimal terms time storage system.
منابع مشابه
Dicoogle, a Pacs Featuring Profiled Content Based Image Retrieval
Content-based image retrieval (CBIR) has been heralded as a mechanism to cope with the increasingly larger volumes of information present in medical imaging repositories. However, generic, extensible CBIR frameworks that work natively with Picture Archive and Communication Systems (PACS) are scarce. In this article we propose a methodology for parametric CBIR based on similarity profiles. The a...
متن کاملEfficient erasure correcting codes
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and sufficient for the decoding process to finish successfully...
متن کاملRepairing Erasure Codes
Distributed storage systems introduce redundancy to increase reliability. When erasure coding is used, the exact repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node. This amounts to a partial recovery of the code, whereas conventional erasure coding focuses on the complete reco...
متن کاملErasure codes with simplex locality
We focus on erasure codes for distributed storage. The distributed storage setting imposes locality requirements because of easy repair demands on the decoder. We first establish the characterization of various locality properties in terms of the generator matrix of the code. These lead to bounds on locality and notions of optimality. We then examine the locality properties of a family of nonbi...
متن کاملMDS codes on the erasure-erasure wiretap channel
This paper considers the problem of perfectly secure communication on a modified version of Wyner’s wiretap channel II where both the main and wiretapper’s channels have some erasures. A secret message is to be encoded into n channel symbols and transmitted. The main channel is such that the legitimate receiver receives the transmitted codeword with exactly n− ν erasures, where the positions of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3187119